The maximum degree and diameter-bounded subgraph in the mesh
نویسندگان
چکیده
منابع مشابه
The Maximum Degree-and-Diameter-Bounded Subgraph in the Mesh
The problem of finding the largest connected subgraph of a given undirected host graph, subject to constraints on the maximum degree ∆ and the diameter D, was introduced in [1], as a generalization of the Degree-Diameter Problem. A case of special interest is when the host graph is a common parallel architecture. Here we discuss the case when the host graph is a k-dimensional mesh. We provide s...
متن کاملThe Maximum Degree & Diameter-Bounded Subgraph and its Applications
We introduce the problem of finding the largest subgraph of a given weighted undirected graph (host graph), subject to constraints on the maximum degree and the diameter. We discuss some applications in security, network design and parallel processing, and in connection with the latter we derive some bounds for the order of the largest subgraph in host graphs of practical interest: the mesh and...
متن کاملMonochromatic bounded degree subgraph partitions
Let F = {F1, F2, . . .} be a sequence of graphs such that Fn is a graph on n vertices with maximum degree at most ∆. We show that there exists an absolute constant C such that the vertices of any 2-edge-colored complete graph can be partitioned into at most 2C∆log ∆ vertex disjoint monochromatic copies of graphs from F . If each Fn is bipartite, then we can improve this bound to 2C∆; this resul...
متن کاملAn ILP formulation and genetic algorithm for the Maximum Degree-Bounded Connected Subgraph problem
A general instance of a Degree-Constrained Subgraph problem may be found in an edgeweighted or vertex-weighted graph Gwhereas the objective is to find an optimal weighted subgraph, subject to certain degree constraints on the vertices of the subgraph. This class of combinatorial problems has been extensively studied due to its numerous applications in network design. If the input graph is bipar...
متن کاملDecreasing the diameter of bounded degree graphs
Let fd(G) denote the minimum number of edges that have to be added to a graph G to transform it into a graph of diameter at most d. We prove that for any graph G with maximum degree D and n > n0(D) vertices, f2(G) = n − D − 1 and f3(G) ≥ n − O(D). For d ≥ 4, fd(G) depends strongly on the actual structure of G, not only on the maximum degree of G. We prove that the maximum of fd(G) over all conn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.03.035